New Upper Bound for the B-Spline Basis Condition Number
نویسندگان
چکیده
منابع مشابه
The Condition of the B-spline Basis for Polynomials*
depends strongly on t. In particular, it can become arbitrarily large if I becomes small in comparison to some of its neighboring knot intervals. In this context, B. Swartz [S] raises the following question: Is it possible to so scale this basis that its condition with respect to the max-norm on I is bounded independently of t ? Precisely, can one find diagonal matrices Ft and Et so that the ma...
متن کاملEstimates for the spectral condition number of cardinal B - spline collocation matrices ∗
The famous de Boor conjecture states that the condition of the polynomial B-spline collocation matrix at the knot averages is bounded independently of the knot sequence, i.e., it depends only on the spline degree. For highly nonuniform knot meshes, like geometric meshes, the conjecture is known to be false. As an effort towards finding an answer for uniform meshes, we investigate the spectral c...
متن کاملA new upper bound on the cyclic chromatic number
A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χc . Let ∗ be themaximum face degree of a graph. There exist plane graphs with χc = 2 ∗ . Ore and Plummer [5] proved that χc ≤ 2 ∗, which bound was improved to 5 ∗ by Borodin, Sand...
متن کاملThe exact condition of the B - spline basis may be hard to determine
The author’s conjecture concerning the knot sequence whose associated B-spline sequence has maximum max-norm condition number is disproved. Related condition numbers are explored and the corresponding conjecture concerning the ‘worst’ knot sequence for them is further supported by numerical results. AMS (MOS) Subject Classifications: primary 41A15, 65F35; secondary 65D07
متن کاملA new upper bound for the bondage number of graphs with small domination number
Let, of the domination number of graph. The bondage number G was first introduced by Fink, Jacobson, the minimum among all sets of holds. In this paper we show that for graph G satisfying
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1999
ISSN: 0021-9045
DOI: 10.1006/jath.1998.3310